Randolph’s Robot Game is NP-complete!
نویسندگان
چکیده
We introduce a new type of movement constraints for a swarm of robots in a grid environment. This type is inspired by Alex Randolphs board game Ricochet Robot and may be used to model robots with very limited abilities for self localization: We assume that once a robot starts to drive in a certain direction, it does not stop its movement until it hits an obstacle wall or another robot. We show that the question, whether a given cell can be reached is NP-complete for arbitrary environments. A Java applet for simulating robot swarms moving with these constraints can be found in http://www.geometrylab.de/RacingRobots/
منابع مشابه
On the Complexity of Randolph’s Robot Game
We introduce a type of movement constraints for a swarm of robots in a grid environment, which is inspired by Alex Randolph’s board game Ricochet Robot and new to the field of robot motion planning. This type of movement may be used to model robots with very limited abilities for self localization: We assume that once a robot starts to drive in a certain direction, it does not stop its movement...
متن کاملMotion planning with pull moves
Sokoban is a game on an integer grid, where a warehouse keeper, or robot, has to push boxes to designated storage locations. He can push a box one cell horizontally or vertically if the destination cell is free. Some of the grid cells can be occupied by unmovable obstacles. Several variants of Sokoban have been studied. In these variants all obstacles may be movable, the keeper may push up to k...
متن کاملOn the Complexity of Deciding Degeneracy in Games
We show that it is NP-Complete to decide whether a bimatrix game is degenerate and it is Co-NP-Complete to decide whether a bimatrix game is nondegenerate.
متن کاملAmazons, Konane, and Cross Purposes are PSPACE-complete
Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a useful platform for both game-theoretic study and AI games research. Buro [3] showed that simple Amazons endgames are NP-equivalent, leaving the complexity of the general case as an open problem. Konane is an ancient Hawaiian game, with moves similar to peg solitaire. Kona...
متن کاملA New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کامل